A Dense Packing of Regular Tetrahedra

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Dense Packing of Regular Tetrahedra

We construct a dense packing of regular tetrahedra, with packing density D > .7786157.

متن کامل

Mysteries in Packing Regular Tetrahedra

T he regular tetrahedron is the simplest Platonic solid. Nevertheless, in studying its packing properties, several renowned scholars have made mistakes, and many questions about it remain unsolved. Currently no one knows the density of its densest packings, the density of its densest translative packings, or the exact value of its congruent kissing number. In this paper we recount historical de...

متن کامل

Dense-packing crystal structures of physical tetrahedra.

We present a method for discovering dense packings of general convex hard particles and apply it to study the dense packing behavior of a one-parameter family of particles with tetrahedral symmetry representing a deformation of the ideal mathematical tetrahedron into a less ideal, physical, tetrahedron and all the way to the sphere. Thus, we also connect the two well-studied problems of sphere ...

متن کامل

Dense Crystalline Dimer Packings of Regular Tetrahedra

We present the densest known packing of regular tetrahedra with density φ = 4000 4671 = 0.856347 . . . . Like the recently discovered packings of Kallus et al. and Torquato–Jiao, our packing is crystalline with a unit cell of four tetrahedra forming two triangular dipyramids (dimer clusters). We show that our packing has maximal density within a three-parameter family of dimer packings. Numeric...

متن کامل

Upper Bound on the Packing Density of Regular Tetrahedra and Octahedra

We obtain an upper bound to the packing density of regular tetrahedra. The bound is obtained by showing the existence, in any packing of regular tetrahedra, of a set of disjoint spheres centered on tetrahedron edges, so that each sphere is not fully covered by the packing. The bound on the amount of space that is not covered in each sphere is obtained in a recursive way by building on the obser...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 2008

ISSN: 0179-5376,1432-0444

DOI: 10.1007/s00454-008-9101-y